Roger Wattenhofer - PDFSEARCH.IO - Document Search Engine

Roger Wattenhofer
Results: 244

#	Item
241	On the Complexity of Distributed Graph Coloring Fabian Kuhn Roger Wattenhofer Microsoft Research – Silicon Valley Add to Reading List Source URL: distcomp.ethz.ch Language: English - Date: 2006-06-02 03:09:51 Fractional coloring Edge coloring Acyclic coloring Graph theory Graph coloring Mathematics
242	The Price of Being Near-Sighted Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer {kuhn,moscitho,wattenhofer}@tik.ee.ethz.ch Computer Engineering and Networks Laboratory, ETH Zurich, 8092 Zurich, Switzerland Abstract Add to Reading List Source URL: distcomp.ethz.ch Language: English - Date: 2005-10-11 11:22:41 Spanning tree NP-complete problems Graph theory Operations research Probabilistic complexity theory Randomized algorithm Linear programming Connectivity Minimum spanning tree Theoretical computer science Computational complexity theory Mathematics
243	Dynamic Analysis of the Arrow Distributed Protocol∗ Fabian Kuhn Roger Wattenhofer Department of Computer Science Add to Reading List Source URL: distcomp.ethz.ch Language: English - Date: 2004-05-18 10:16:22 Spanning tree Binary trees Minimum spanning tree Travelling salesman problem Rope Theoretical computer science Graph theory Computational complexity theory
244	A Self-Repairing Peer-to-Peer System Resilient to Dynamic Adversarial Churn? Fabian Kuhn, Stefan Schmid, and Roger Wattenhofer Computer Engineering and Networks Laboratory ETH Zurich 8092 Zurich, Switzerland Add to Reading List Source URL: distcomp.ethz.ch Language: English - Date: 2006-04-17 07:11:23 Distributed computing Peer-to-peer Chord Distributed hash table Node Scalability ANts P2P Rete algorithm Distributed data storage Computing Concurrent computing

UPDATE